Sparse FFT for Functions with Short Frequency Support
نویسندگان
چکیده
In this paper we derive a deterministic fast discrete Fourier transform algorithm for a 2π-periodic function f whose Fourier coefficients with significantly large magnitude are contained inside a support interval of length B. The algorithm is based on a method for the efficient recovery of B-sparse 2π-periodic functions presented by Iwen in [15]. If a good bound B on the support length is known apriori, our algorithm needs O B log B log 2 N/B log log N/B arithmetical operations while using O B log 2 N/B log log N/B samples of the input function f .
منابع مشابه
A Deterministic Sparse FFT for Functions with Structured Fourier Sparsity
In this paper a deterministic sparse Fourier transform algorithm is presented which breaks the quadratic-in-sparsity runtime bottleneck for a large class of periodic functions exhibiting structured frequency support. These functions include, e.g., the oft-considered set of block frequency sparse functions of the form
متن کاملPathologies cardiac discrimination using the Fast Fourir Transform (FFT) The short time Fourier transforms (STFT) and the Wigner distribution (WD)
This paper is concerned with a synthesis study of the fast Fourier transform (FFT), the short time Fourier transform (STFT and the Wigner distribution (WD) in analysing the phonocardiogram signal (PCG) or heart cardiac sounds. The FFT (Fast Fourier Transform) can provide a basic understanding of the frequency contents of the heart sounds. The STFT is obtained by calculating the Fourier tran...
متن کاملUsing WPT as a New Method Instead of FFT for Improving the Performance of OFDM Modulation
Orthogonal frequency division multiplexing (OFDM) is used in order to provide immunity against very hostile multipath channels in many modern communication systems.. The OFDM technique divides the total available frequency bandwidth into several narrow bands. In conventional OFDM, FFT algorithm is used to provide orthogonal subcarriers. Intersymbol interference (ISI) and intercarrier interferen...
متن کاملUncertainty in time–frequency representations on finite Abelian groups and applications
Classical and recent results on uncertainty principles for functions on finite Abelian groups relate the cardinality of the support of a function to the cardinality of the support of its Fourier transforms. We obtain corresponding results relating the support sizes of functions and their short–time Fourier transforms. We use our findings to construct a class of equal norm tight Gabor frames tha...
متن کاملSparse Fast Fourier Transform for Exactly and Generally K-Sparse Signals by Downsampling and Sparse Recovery
Fast Fourier Transform (FFT) is one of the most important tools in digital signal processing. FFT costs O(N logN) for transforming a signal of length N . Recently, researchers at MIT have proposed Sparse Fast Fourier Transform (sFFT) [1][2] as a breakthrough with computational complexity O(K logN) and O(K logN log N K ) for exactly K-sparse signal (with only K non-zero frequency grids) and gene...
متن کامل